Predicting Success in an Imperfect-Information Game
نویسندگان
چکیده
One of the most challenging tasks when creating an adaptation mechanism is to transform domain knowledge into an evaluation function that adequately measures the quality of the generated solutions. The high complexity of modern video games makes the task to generate a suitable evaluation function for adaptive game AI even more difficult. Still, our aim is to fully automatically generate an evaluation function for adaptive game AI. This paper describes our approach, and discusses the experiments performed in the RTS game Spring. TD-learning is applied for establishing a unit-based evaluation term. In addition, we define a term that evaluates tactical positions. From our results we may conclude that an evaluation function based on the defined terms is able to predict the outcome of a Spring game reasonably well. That is, for a unit-based evaluation the evaluation function is correct in about 76% of all games played, and when evaluating tactical positions it is correct in about 97% of all games played. A straightforward combination of the two terms did not produce improved results.
منابع مشابه
Biding Strategy in Restructured Environment of Power Market Using Game Theory
In the restructured environment of electricity market, firstly the generating companies and the customers are looking for maximizing their profit and secondly independent system operator is looking for the stability of the power network and maximizing social welfare. In this paper, a one way auction in the electricity market for the generator companies is considered in both perfect and imperfec...
متن کاملEnhancing Artificial Intelligence on a Real Mobile Game
Mobile games represent a killer application that is attracting millions of subscribers worldwide. One of the aspects crucial to the commercial success of a game is ensuring an appropriately challenging artificial intelligence (AI) algorithm against which to play. However, creating this component is particularly complex as classic search AI algorithms cannot be employed by limited devices such a...
متن کاملCombining Prediction of Human Decisions with ISMCTS in Imperfect Information Games
Monte Carlo Tree Search (MCTS) has been extended to many imperfect information games. However, due to the added complexity that uncertainty introduces, these adaptations have not reached the same level of practical success as their perfect information counterparts. In this paper we consider the development of agents that perform well against humans in imperfect information games with partially ...
متن کاملAn Expert-Level Card Playing Agent Based on a Variant of Perfect Information Monte Carlo Sampling
Despite some success of Perfect Information Monte Carlo Sampling (PIMC) in imperfect information games in the past, it has been eclipsed by other approaches in recent years. Standard PIMC has well-known shortcomings in the accuracy of its decisions, but has the advantage of being simple, fast, robust and scalable, making it well-suited for imperfect information games with large state-spaces. We...
متن کاملMonte Carlo Tree Search in Imperfect-Information Games Doctoral Thesis
Monte Carlo Tree Search (MCTS) is currently the most popular game playing algorithm for perfect-information extensive-form games. Its adaptation led, for example, to human expert level Go playing programs or substantial improvement of solvers for domain-independent automated planning. Inspired by this success, researchers started to adapt this technique also for imperfect-information games. Imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007